<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.12"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>emp-toolkit: /Users/wangxiao/git/emp-toolkit/emp-tool/circuits/number.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo-full-doxygen.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">emp-toolkit
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.12 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('number_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">number.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="number_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef NUMBER_H__</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#define NUMBER_H__</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="bit_8h.html">bit.h</a>&quot;</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;</div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;</div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> D&gt;</div><div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="number_8h.html#a233c02e8010f3e9f62160b3fc5868c05">    7</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="number_8h.html#a233c02e8010f3e9f62160b3fc5868c05">cmp_swap</a>(T*key, D*data, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j, <a class="code" href="class_bit.html">Bit</a> acc) {</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    <a class="code" href="class_bit.html">Bit</a> to_swap = ((key[i] &gt; key[j]) == acc);</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <a class="code" href="swappable_8h.html#a4043c520b57fcca7b1eaa03102828a0a">swap</a>(to_swap, key[i], key[j]);</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordflow">if</span>(data != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <a class="code" href="swappable_8h.html#a4043c520b57fcca7b1eaa03102828a0a">swap</a>(to_swap, data[i], data[j]);</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;}</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"><a class="line" href="number_8h.html#ada05ad9eb230db32857347bcacdfafd7">   14</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="number_8h.html#ada05ad9eb230db32857347bcacdfafd7">greatestPowerOfTwoLessThan</a>(<span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">int</span> k = 1;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordflow">while</span> (k &lt; n)</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        k = k &lt;&lt; 1;</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordflow">return</span> k &gt;&gt; 1;</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;}</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> D&gt;</div><div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="number_8h.html#a995b0925e6e3fda7a003692d67203d2a">   22</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="number_8h.html#a995b0925e6e3fda7a003692d67203d2a">bitonic_merge</a>(T* key, D* data, <span class="keywordtype">int</span> lo, <span class="keywordtype">int</span> n, <a class="code" href="class_bit.html">Bit</a> acc) {</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordflow">if</span> (n &gt; 1) {</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">int</span> m = <a class="code" href="number_8h.html#ada05ad9eb230db32857347bcacdfafd7">greatestPowerOfTwoLessThan</a>(n);</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lo; i &lt; lo + n - m; i++)</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;            <a class="code" href="number_8h.html#a233c02e8010f3e9f62160b3fc5868c05">cmp_swap</a>(key, data, i, i + m, acc);</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <a class="code" href="number_8h.html#a995b0925e6e3fda7a003692d67203d2a">bitonic_merge</a>(key, data, lo, m, acc);</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <a class="code" href="number_8h.html#a995b0925e6e3fda7a003692d67203d2a">bitonic_merge</a>(key, data, lo + m, n - m, acc);</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    }</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;}</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> D&gt;</div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="number_8h.html#a3093cb424e7435ba5c555049360d5903">   33</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="number_8h.html#a3093cb424e7435ba5c555049360d5903">bitonic_sort</a>(T * key, D * data, <span class="keywordtype">int</span> lo, <span class="keywordtype">int</span> n, <a class="code" href="class_bit.html">Bit</a> acc) {</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordflow">if</span> (n &gt; 1) {</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">int</span> m = n / 2;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <a class="code" href="number_8h.html#a3093cb424e7435ba5c555049360d5903">bitonic_sort</a>(key, data, lo, m, !acc);</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <a class="code" href="number_8h.html#a3093cb424e7435ba5c555049360d5903">bitonic_sort</a>(key, data, lo + m, n - m, acc);</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <a class="code" href="number_8h.html#a995b0925e6e3fda7a003692d67203d2a">bitonic_merge</a>(key, data, lo, n, acc);</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    }</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;}</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> D = Bit&gt;</div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="number_8h.html#a6bd8a07f72acde85d8fcc48f33a56e11">   43</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="number_8h.html#a6bd8a07f72acde85d8fcc48f33a56e11">sort</a>(T * key, <span class="keywordtype">int</span> size, D* data = <span class="keyword">nullptr</span>, <a class="code" href="class_bit.html">Bit</a> acc = <span class="keyword">true</span>) {</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    <a class="code" href="number_8h.html#a3093cb424e7435ba5c555049360d5903">bitonic_sort</a>(key, data, 0, size, acc);</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;}</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="preprocessor">#endif</span></div><div class="ttc" id="number_8h_html_a6bd8a07f72acde85d8fcc48f33a56e11"><div class="ttname"><a href="number_8h.html#a6bd8a07f72acde85d8fcc48f33a56e11">sort</a></div><div class="ttdeci">void sort(T *key, int size, D *data=nullptr, Bit acc=true)</div><div class="ttdef"><b>Definition:</b> number.h:43</div></div>
<div class="ttc" id="number_8h_html_ada05ad9eb230db32857347bcacdfafd7"><div class="ttname"><a href="number_8h.html#ada05ad9eb230db32857347bcacdfafd7">greatestPowerOfTwoLessThan</a></div><div class="ttdeci">int greatestPowerOfTwoLessThan(int n)</div><div class="ttdef"><b>Definition:</b> number.h:14</div></div>
<div class="ttc" id="number_8h_html_a3093cb424e7435ba5c555049360d5903"><div class="ttname"><a href="number_8h.html#a3093cb424e7435ba5c555049360d5903">bitonic_sort</a></div><div class="ttdeci">void bitonic_sort(T *key, D *data, int lo, int n, Bit acc)</div><div class="ttdef"><b>Definition:</b> number.h:33</div></div>
<div class="ttc" id="number_8h_html_a995b0925e6e3fda7a003692d67203d2a"><div class="ttname"><a href="number_8h.html#a995b0925e6e3fda7a003692d67203d2a">bitonic_merge</a></div><div class="ttdeci">void bitonic_merge(T *key, D *data, int lo, int n, Bit acc)</div><div class="ttdef"><b>Definition:</b> number.h:22</div></div>
<div class="ttc" id="swappable_8h_html_a4043c520b57fcca7b1eaa03102828a0a"><div class="ttname"><a href="swappable_8h.html#a4043c520b57fcca7b1eaa03102828a0a">swap</a></div><div class="ttdeci">void swap(const Bit &amp;swap, T &amp;o1, T &amp;o2)</div><div class="ttdef"><b>Definition:</b> swappable.h:18</div></div>
<div class="ttc" id="class_bit_html"><div class="ttname"><a href="class_bit.html">Bit</a></div><div class="ttdef"><b>Definition:</b> bit.h:8</div></div>
<div class="ttc" id="number_8h_html_a233c02e8010f3e9f62160b3fc5868c05"><div class="ttname"><a href="number_8h.html#a233c02e8010f3e9f62160b3fc5868c05">cmp_swap</a></div><div class="ttdeci">void cmp_swap(T *key, D *data, int i, int j, Bit acc)</div><div class="ttdef"><b>Definition:</b> number.h:7</div></div>
<div class="ttc" id="bit_8h_html"><div class="ttname"><a href="bit_8h.html">bit.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_eec959d81771dc8b1a750b834e1341eb.html">emp-tool</a></li><li class="navelem"><a class="el" href="dir_2b4671b717884caf3b3fe5ce6896c1bb.html">circuits</a></li><li class="navelem"><a class="el" href="number_8h.html">number.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.12 </li>
  </ul>
</div>
</body>
</html>
